Exact Minkowski Sums of Polygons With Holes
نویسندگان
چکیده
We present an efficient algorithm that computes the Minkowski sum of two polygons, which may have holes. The new algorithm is based on the convolution approach. Its efficiency stems in part from a property for Minkowski sums of polygons with holes, which in fact holds in any dimension: Given two polygons with holes, for each input polygon we can fill up the holes that are relatively small compared to the other polygon. Specifically, we can always fill up all the holes of at least one polygon, transforming it into a simple polygon, and still obtain exactly the same Minkowski sum. Obliterating holes in the input summands speeds up the computation of Minkowski sums. We introduce a robust implementation of the new algorithm, which follows the Exact Geometric Computation paradigm and thus guarantees exact results. We also present an empirical comparison of the performance of Minkowski sum construction of various input examples, where we show that the implementation of the new algorithm exhibits better performance than several other implementations in many cases. In particular, we compared the implementation of the new algorithm, an implementation of the standard convolution algorithm, and an implementation of the decomposition approach using various convex decomposition methods, including two new methods that handle polygons with holes—one is based on vertical decomposition and the other is based on triangulation. The software has been developed as an extension of the 2D Minkowski Sums package of Cgal (Computational Geometry Algorithms Library). Additional information and supplementary material is available at our project page http://acg.cs.tau.ac.il/projects/rc. 1Work by E.F. and D.H. has been supported in part by the Israel Science Foundation (grant no. 1102/11), by the German-Israeli Foundation (grant no. 1150-82.6/2011), and by the Hermann Minkowski–Minerva Center for Geometry at Tel Aviv University. 2Work by S.M. and M.H. has been supported by Google Summer of Code 2014. 1 ar X iv :1 50 2. 06 19 5v 3 [ cs .C G ] 2 8 A pr 2 01 5
منابع مشابه
Exact and Efficient Construction of Planar Minkowski Sums Using the Convolution Method
TheMinkowski sum of two setsA,B ∈ IR, denotedA⊕B, is defined as {a+ b | a ∈ A, b ∈ B}. We describe an efficient and robust implementation for the construction of Minkowski sums of polygons in IR using the convolution of the polygon boundaries. This method allows for faster computation of the sum of non-convex polygons in comparison to the widely-used methods for Minkowski-sum computation that d...
متن کاملTEL-AVIV UNIVERSITY RAYMOND AND BEVERLY SACKLER FACULTY OF EXACT SCIENCES SCHOOL OF COMPUTER SCIENCE Minkowski Sums of Simple Polygons
Let P be a simple polygon with m edges, which is the disjoint union of k simple polygons, all monotone in a common direction u, and let Q be another simple polygon with n edges, which is the disjoint union of l simple polygons, all monotone in a common direction v. We show that the combinatorial complexity of the Minkowski sum P ⊕ Q is O(klmnα(min{m,n})). Some structural properties of the case ...
متن کاملPolygon Decomposition for Efficient Construction of Minkowski Sums
Several algorithms for computing the Minkowski sum of two polygons in the plane begin by decomposing each polygon into convex subpolygons. We examine diierent methods for decomposing polygons by their suitability for eecient construction of Minkowski sums. We study and experiment with various well-known decompositions as well as with several new decomposition schemes. We report on our experimen...
متن کاملPolygonal Minkowski Sums via Convolution : Theory and Practice
This thesis studies theoretical and practical aspects of the computation of planar polygonal Minkowski sums via convolution methods. In particular we prove the “Convolution Theorem”, which is fundamental to convolution based methods, for the case of simple polygons. To the best of our knowledge this is the first complete proof for this case. Moreover, we describe a complete, exact and efficient...
متن کاملPii: S0925-7721(01)00041-4
Several algorithms for computing the Minkowski sum of two polygons in the plane begin by decomposing each polygon into convex subpolygons. We examine different methods for decomposing polygons by their suitability for efficient construction of Minkowski sums. We study and experiment with various well-known decompositions as well as with several new decomposition schemes. We report on our experi...
متن کامل